/*
day366 
2020.8.28 
*/
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;

class Solution {
public:
    int maximumProduct(vector<int>& nums) {
		sort(nums.begin(),nums.end());
		
		int size=nums.size();
		int mun1=nums[size-1]*nums[size-2]*nums[size-3];
		int mun2=nums[0]*nums[1]*nums[size-1];
		
		return max(mun1,mun2);
    }
}; 

int main()
{
	return 0;
}
